Characterization of Fuzzy Graphs into different categories using Arcs in Fuzzy Graphs
نویسندگان
چکیده
منابع مشابه
Coverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملConnected domination in fuzzy graphs using strong arcs
Abstract. In this paper, connected domination in fuzzy graphs using strong arcs is introduced. The strong connected domination number of different classes of fuzzy graphs is obtained. An upper bound for the strong connected domination number of fuzzy graphs is obtained. Strong connected domination in fuzzy trees is studied. It is established that the set of fuzzy cut nodes of a fuzzy tree is a ...
متن کاملTotal Domination in Fuzzy Graphs Using Strong Arcs
In this paper we introduce the concept of strong total domination in fuzzy graphs. We determine the strong total domination number for several classes of fuzzy graphs. A lower bound and an upper bound for the strong total domination number in terms of strong domination number is obtained. Strong total domination in fuzzy trees is studied. A necessary and sufficient condition for the set of fuzz...
متن کاملStructural properties of fuzzy graphs
Matroids are important combinatorial structures and connect close-lywith graphs. Matroids and graphs were all generalized to fuzzysetting respectively. This paper tries to study connections betweenfuzzy matroids and fuzzy graphs. For a given fuzzy graph, we firstinduce a sequence of matroids from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. A fuzzy matroid, named graph fuzzy matro...
متن کاملOn Strongest Paths, Delta Arcs and Blocks in Fuzzy Graphs
In this paper we study strongest paths in a fuzzy graph. A necessary and sufficient condition for an arc in a fuzzy graph to be a strongest path and a sufficient condition for a path in a fuzzy graph to be a strongest path are obtained. A characterization of δ−arcs and the relationship between fuzzy cutnodes and δ−arcs are also obtained. Also a characterization of blocks is obtained using stron...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Fuzzy Set Valued Analysis
سال: 2014
ISSN: 2193-4169
DOI: 10.5899/2014/jfsva-00222